منابع مشابه
Analytic Urns Philippe Flajolet
The talk1 describes an analytic approach to urn models of the Pólya type where an urn may contain balls of either of two colours. At each step, a ball is randomly drawn and replaced by balls of the two colours; a fixed 2× 2-matrix with constant row sum determines the replacement policy. The treatment starts from a partial differential equation associated with the model and bases itself on confo...
متن کامل2 Philippe Flajolet and Brigitte Vall
To Jonathan Borwein, on the occasion of his award of a Doctorate Honoris Causa Abstract. There are known algorithms based on continued fractions for comparing fractions and for determining the sign of 2 2 determinants. The analysis of such extremely simple algorithms leads to an incursion into a surprising variety of domains. We take the reader through a light tour of dynamical systems (symboli...
متن کاملPhilippe Flajolet and the Airy Function
1. Historical backgrounds: the Airy function in Physics 2 2. The area-Airy distributions: Brownian motion, linear probing hashing, additive parameters in grammars 4 2.1. Area under a Brownian excursion 4 2.2. On the analysis of linear probing hashing 4 2.3. Analytic variations on the Airy distribution 5 2.4. Hachage, arbres, chemins & graphes 6 3. Random matrices, Airy kernel and the Tracy–Wido...
متن کاملIn memoriam: Philippe Flajolet, the father of analytic combinatorics
Philippe Flajolet, mathematician and computer scientist extraordinaire, suddenly passed away on March 22, 2011, at the prime of his career. He is celebrated for opening new lines of research in analysis of algorithms, developing powerful new methods, and solving difficult open problems. His research contributions will have impact for generations, and his approach to research, based on curiosity...
متن کاملA Calculus for the Random Generation of Combinatorial Structures Philippe Flajolet
A systematic approach to the random generation of labelled combinatorial objects is presented. It applies to structures that are decomposable, i.e., formally speci able by grammars involving set, sequence, and cycle constructions. A general strategy is developed for solving the random generation problem with two closely related types of methods: for structures of size n, the boustrophedonic alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2011
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2011.06.003